On the Invariant Many-one Packet Routing in Multi-link Binary Hypercubes
نویسنده
چکیده
The paper considers the necessity conditions for the existence of many-one destination graphs in multi-link hypercubes. It is shown that many-one modular destination graphs for minimum routing exist for dimensions five and six in the two-link hypercube, and also for dimension seven in the three-link hypercube. The combination of two many-one modular graphs forms a new modular graph for invariant oblivious permutation routing. As a result, modular destination graphs for minimum permutation routing in two-link hypercubes exist for dimensions 9, 10, 11, and 12. In three-link hypercubes such graphs exist for dimensions 13 and 14. An advantage of this approach is that (for any source-destination pair of an arbitrary permutation) two distinct packets can be simultaneously transmitted within a network cycle of n routing steps in the n-dimensional hypercube.
منابع مشابه
Some Permutation Routing Algorithms for Low Dimensional Hypercubes
Oblivious permutation routing in binary d cubes has been well studied in the litera ture In a permutation routing each node initially contains a packet with a destination such that all the d destinations are distinct Kaklamanis Krizanc and Tsantilas used the decomposability of hypercubes into Hamiltonian circuits to give an asymptotically opti mal routing algorithm The notion of destination gra...
متن کاملSome permutation routing algorithms for low-dimensional hypercubes
Oblivious permutation routing in binary d-cubes has been well studied in the literature. In a permutation routing, each node initially contains a packet with a destination such that all the 2 destinations are distinct. Kaklamanis et al. (Math. Syst. Theory 24 (1991) 223–232) used the decomposability of hypercubes into Hamiltonian circuits to give an asymptotically optimal routing algorithm. The...
متن کاملA Secure Routing Algorithm for Underwater Wireless Sensor Networks
Recently, underwater Wireless Sensor Networks (UWSNs) attracted the interest of many researchers and the past three decades have held the rapid progress of underwater acoustic communication. One of the major problems in UWSNs is how to transfer data from the mobile node to the base stations and choosing the optimized route for data transmission. Secure routing in UWSNs is necessary for packet d...
متن کاملA New Method based on Intelligent Water Drops for Multicast Routing in Wireless Mesh Networks
In recent years a new type of wireless networks named wireless mesh networks has drawn the attention of researchers. In order to increase the capacity of mesh network, nodes are equipped with multiple radios tuned on multiple channels emerging multi radio multi channel wireless mesh networks. Therefore, the main challenge of these networks is how to properly assign the channels to the radios. O...
متن کاملSome Permutation Routing Algorithms for Low Dimensional HypercubesbyF
Oblivious permutation routing in binary d-cubes has been well studied in the literature. In a permutation routing, each node initially contains a packet with a destination such that all the 2 d destinations are distinct. Kaklamanis, Krizanc and Tsantilas 6] used the decomposability of hypercubes into Hamiltonian circuits to give an asymptotically optimal routing algorithm. The notion of \destin...
متن کامل